On Nachbin's characterization of a Boolean lattice.
نویسندگان
چکیده
منابع مشابه
Characterization of Partial Lattices on Countable Boolean Lattice
In this paper new concepts countable join property, countable meet property, P–lattice and Pδ –lattice are introduced. We established that P–lattice and Pδ –lattice are measureable partial lattices and characterized partial lattices of a lattice through countable join and meet properties. We also established some interesting result on the injective property of the lattice measurable functio...
متن کاملThe Lattice of Contact Relations on a Boolean Algebra
Contact relations on an algebra have been studied since the early part of the previous century, and have recently become a powerful tool in several areas of artificial intelligence, in particular, qualitative spatial reasoning and ontology building. In this paper we investigate the structure of the set of all contact relations on a Boolean algebra.
متن کاملDiffusion Limited Aggregation on the Boolean Lattice
In the Diffusion Limited Aggregation (DLA) process on on Z, or more generally Z, particles aggregate to an initially occupied origin by arrivals on a random walk. The scaling limit of the result, empirically, is a fractal with dimension strictly less than d. Very little has been shown rigorously about the process, however. We study an analogous process on the Boolean lattice {0, 1}, in which pa...
متن کاملThe Genetic Code Boolean Lattice
The algebraic structures of the genetic code are most important to obtain additional information about the semantic code and its applications. In this paper we define two dual Boolean codon lattices of the genetic code using hydrogen bond numbers and the chemical types of bases: purines and pyrimidines. The Boolean lattices reflect the role of hydrophobicity in the distribution of codon assignm...
متن کاملSupersaturation in the Boolean lattice
We prove a “supersaturation-type” extension of both Sperner’s Theorem (1928) and its generalization by Erdős (1945) to k-chains. Our result implies that a largest family whose size is x more than the size of a largest k-chain free family and that contains the minimum number of k-chains is the family formed by taking themiddle (k−1) rows of the Boolean lattice and x elements from the kthmiddle r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1976
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093887437